#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int a[100005];
cin>>n;
int k=0,lt=0,rt=0,l=1,r=1000000;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]>500000&&k==0)
{
k=i;
}
}
if(k!=0)
{
for(int i=1;i<k;i++)
{
lt=lt+a[i]-l;
l=a[i];
}
for(int i=n;i>=k;i--)
{
rt=rt+r-a[i];
r=a[i];
}
}
else
{
for(int i=1;i<=n;i++)
{
lt=lt+a[i]-l;
l=a[i];
}
}
// cout<<k<<" "<<lt<<" "<<rt<<endl;
if(rt!=0&<!=0)
cout<<max(rt,lt);
else
{
if(rt==0)
cout<<lt;
else
cout<<rt;
}
return 0;
}
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |